A short introduction to Ordinal Notations

نویسنده

  • Harold Simmons
چکیده

I will give a pseudo-historical account. The account is historical for I will describe some of the principal developments of the subject in the chronological order of occurrence (with one or two time warps). The account is pseudo for several reasons. Some of the historical remarks may not be strictly accurate. I am not an historian, and I haven’t checked all the appropriate primary sources. However, I haven’t tried to deliberately falsify the story. As with most mathematics, some things we can do better now than when they were first developed. Sometimes I take the more recent approach. This is only a short account, so several, perhaps many, topics have been omitted. At this stage these topics can be seen as peripheral, but in a longer account they would have greater prominence. This account is historical not because I want to write a history, but because I find that mode the easiest way to present this particular material. For some other subjects I would not try an historical account, but for this subject it seems to work. It is hard to find a decent overview or true history of this subject. However, I do recommend [6] for a short history (as it then stood).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Method for Detection of Epilepsy in Short and Noisy EEG Signals Using Ordinal Pattern Analysis

Introduction: In this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. Epilepsy is considered as a dynamical change in nonlinear and complex brain system. The ability of the proposed measure for characterizing the normal and epileptic EEG signals when the signal is short or is...

متن کامل

Constructive Versions of Ordinal Number Classes

0. Introduction and summary. Almost from its beginning, the theory of ordinal numbers has included results which can, in a rather concrete sense, be viewed as theorems about notations for ordinal numbers. For example the theorems on polynomial normal forms for those ordinals that lie below the least e number can be understood as providing a certain unique notation of finite length for each such...

متن کامل

An Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations

The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...

متن کامل

An ordinal analysis of admissible set theory using recursion on ordinal notations ∗ Jeremy Avigad

The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...

متن کامل

An overview of the ordinal calculator

An ordinal calculator has been developed as an aid for understanding the countable ordinal hierarchy and as a research tool that may eventually help to expand it. A GPL licensed version is available in C++. It is an interactive command line calculator and can be used as a library. It includes notations for the ordinals uniquely expressible in Cantor normal form, the Veblen hierarchies and a for...

متن کامل

Ordinal notations and well-orderings in bounded arithmetic

Ordinal notations and provability of well-foundedness have been a central tool in the study of the consistency strength and computational strength of formal theories of arithmetic. This development began with Gentzen’s consistency proof for Peano arithmetic based on the well-foundedness of ordinal notations up to ǫ0. Since the work of Gentzen, ordinal notations and provable wellfoundedness have...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006